The Resource Lambda Calculus Is Short-Sighted in Its Relational Model
نویسنده
چکیده
Relational semantics is one of the simplest and categorically most natural semantics of Linear Logic. The co-Kleisli category MRel associated with its multiset exponential comonad contains a fully abstract model of the untyped λ-calculus. That particular object of MRel is also a model of the resource λ-calculus, deriving from Ehrhard and Regnier’s differential extension of Linear Logic and related to Boudol’s λ-calculus with multiplicities. Bucciarelli et al. conjectured that model to be fully-abstract also for the resource λ-calculus. We give a counterexample to the conjecture. As a by-product we achieve a context lemma for the resource λ-calculus.
منابع مشابه
An application of the extensional collapse of the relational model of linear logic
We proved recently that the extensional collapse of the relational model of linear logic coincides with its Scott model, whose objects are preorders and morphisms are downwards closed relations. This result is obtained by the construction of a new model whose objects can be understood as preorders equipped with a realizability predicate. We present this model, which features a new duality, and ...
متن کاملCollapsing non-idempotent intersection types
We proved recently that the extensional collapse of the relational model of linear logic coincides with its Scott model, whose objects are preorders and morphisms are downwards closed relations. This result is obtained by the construction of a new model whose objects can be understood as preorders equipped with a realizability predicate. We present this model, which features a new duality, and ...
متن کاملThe Scott model of linear logic is the extensional collapse of its relational model
We show that the extensional collapse of the relational model of linear logic is the model of prime-algebraic complete lattices, a natural extension to linear logic of the well known Scott semantics of the lambda-calculus.
متن کاملFull Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
We study the semantics of a resource-sensitive extension of the lambda calcu-lus in a canonical reflexive object of a category of sets and relations, a relational version ofScott’s original model of the pure lambda calculus. This calculus is related to Boudol’s re-source calculus and is derived from Ehrhard and Regnier’s differential extension of LinearLogic and of the lambda ca...
متن کاملA Semantical and Operational Account of Call-by-Value Solvability
In Plotkin’s call-by-value lambda-calculus, solvable terms are characterized syntactically by means of call-by-name reductions and there is no neat semantical characterization of such terms. Preserving confluence, we extend Plotkin’s original reduction without adding extra syntactical constructors, and we get a call-by-value operational characterization of solvable terms. Moreover, we give a se...
متن کامل